Random Pattern Generation Processes *

نویسندگان

  • BRUCE SCHACHTER
  • NARENDRA AHUJA
چکیده

This paper deals with a new class of image models called mosaic models that view an image as a random pattern and model it by an appropriate planar process. There are several different kinds of image models in use. Mandelbrot, [l] models irregular and fragmentary natural patterns by Brownian surfaces (Fig. 1). Wong [2], H assner [3], and others model images by two-dimensional random fields. Matheron [4] and a number of other French mathematicians describe random spatial patterns in terms of regionalized random variables. McCormick and Jayaramamurthy [5] and others use time series analysis to model the row-scan of the image. In this paper we provide an overview of a variety of mosaic models. Subsequent’ papers will discuss their specific properties and their applications to images. We describe a number of models for spatial point patterns in Section 2. The ‘<most random” of these, the Poisson point process, will be used in the construction of most of the succeeding patterns. In Section 3, we will model piecewise contiguous patterns by random mosaics. The use of mosaics to depict patterns is ancient. The Chaldeans were skilled mosaicists by 2500 BCE. The Greeks further developed the art and were thought to have used pattern books for standard motifs. The pieces of a mosaic were

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Central Limit Theorem in Multitype Branching Random Walk

A discrete time multitype (p-type) branching random walk on the real line R&nbsp;is considered. The positions of the j-type individuals in the n-th generation form a point process. The asymptotic behavior of these point processes, when the generation size tends to infinity, is studied. The central limit theorem is proved.

متن کامل

Analysis of Pattern Generation and Randomness for LFSRs

The main goal of genetic programming is to get best pattern in terms of randomness. There are various methods for random pattern generation. The patterns generated in this paper are pseudo-random in nature. Different types of linear feedback shift register (LFSR) are used to generate pseudo-random patterns and test their randomness by various testing algorithms. Random patterns are compared acc...

متن کامل

Weighted Random Test Pattern Generation Using Genetic Alogrithms

In this paper, a genetic algorithm (GA) approach for the weighted random testing is discussed. Analyzing optimal weights for weighted random testing is a very complicated problem. GA is applied to obtain efficient weights for random pattern generation. Simulation results show that GA is an effective method to solve the problem.

متن کامل

Test Pattern Generation Using a Dual MAC Unit

BIST (built-in self test) is one of the most attractive solutions to test chips at speed. In this paper, we present a new test pattern generation method using the processing units of DSP (digital signal processing). This method utilizes dual MAC (multiply and accumulate) units, which consist of two multipliers and several accumulators, in DSP to generate test patterns. The proposed test pattern...

متن کامل

Gamma: Random Generation: Models, Methods and Algorithms

The goal of this project, ”Random Generation: Models, Methods and Algorithms”, is to develop a set of fundamental methods and algorithms for the random generation of complex combinatorial structures. Such objects appear in a variety of applications, especially in computer science. Random generation plays an important role in domains dealing with enormous volumes of data, for example in interact...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1978